Conjugate Gradient Hard Thresholding Pursuit Algorithm for Sparse Signal Recovery
نویسندگان
چکیده
منابع مشابه
Iterative Soft/Hard Thresholding Homotopy Algorithm for Sparse Recovery
In this note, we analyze an iterative soft / hard thresholding algorithm with homotopy continuation for recovering a sparse signal x† from noisy data of a noise level . Under standard regularity and sparsity conditions, we design a path along which the algorithm will find a solution x∗ which admits sharp reconstruction error ‖x−x‖`∞ = O( ) with an iteration complexity O( ln ln ρ np), where n an...
متن کاملExact Recovery of Hard Thresholding Pursuit
The Hard Thresholding Pursuit (HTP) is a class of truncated gradient descent methods for finding sparse solutions of l0-constrained loss minimization problems. The HTP-style methods have been shown to have strong approximation guarantee and impressive numerical performance in high dimensional statistical learning applications. However, the current theoretical treatment of these methods has trad...
متن کاملGradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization
Hard Thresholding Pursuit (HTP) is an iterative greedy selection procedure for finding sparse solutions of underdetermined linear systems. This method has been shown to have strong theoretical guarantee and impressive numerical performance. In this paper, we generalize HTP from compressive sensing to a generic problem setup of sparsity-constrained convex optimization. The proposed algorithm ite...
متن کاملOrthogonal Matching Pursuit for Sparse Signal Recovery
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional sparse signal based on a small number of noisy linear measurements. OMP is an iterative greedy algorithm that selects at each step the column which is most correlated with the current residuals. In this paper, we present a fully data driven OMP algorithm with explicit stopping rules. It is shown t...
متن کاملApproximated Function Based Spectral Gradient Algorithm for Sparse Signal Recovery
Numerical algorithms for the l0-norm regularized non-smooth non-convex minimization problems have recently became a topic of great interest within signal processing, compressive sensing, statistics, and machine learning. Nevertheless, the l0norm makes the problem combinatorial and generally computationally intractable. In this paper, we construct a new surrogate function to approximate l0-norm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12020036